Planting Colourings Silently
نویسندگان
چکیده
منابع مشابه
Planting Colourings Silently
Let k ≥ 3 be a fixed integer and let Zk(G) be the number of k-colourings of the graph G. For certain values of the average degree, the random variable Zk(G(n,m)) is known to be concentrated in the sense that 1 n (lnZk(G(n,m)) − lnE[Zk(G(n,m))]) converges to 0 in probability [Achlioptas and Coja-Oghlan: Proc. FOCS 2008]. In the present paper we prove a significantly stronger concentration result...
متن کاملThe Silently Shifting Semicolon
Memory consistency models for modern concurrent languages have largely been designed from a system-centric point of view that protects, at all costs, optimizations that were originally designed for sequential programs. The result is a situation that, when viewed from a programmer’s standpoint, borders on absurd. We illustrate this unfortunate situation with a brief fable and then examine the op...
متن کاملCAIN: Silently Breaking ASLR in the Cloud
Modern systems rely on Address-Space Layout Randomization (ASLR) and Data Execution Prevention (DEP) to protect software against memory corruption vulnerabilities. The security of ASLR depends on randomizing regions in memory which can be broken by leaking addresses. While information leaks are common for client applications, server software has been hardened to reduce such information leaks. M...
متن کاملCaspase-8: not so silently deadly
Apoptosis is a caspase-dependent programmed form of cell death, which is commonly believed to be an immunologically silent process, required for mammalian development and maintenance of cellular homoeostasis. In contrast, lytic forms of cell death, such as RIPK3- and MLKL-driven necroptosis, and caspase-1/11-dependent pyroptosis, are postulated to be inflammatory via the release of damage assoc...
متن کاملDistance-regular graphs, MH-colourings and MLD-colourings
It is shown that the only bipartite distance regular graphs of diameter 3 which are MLDcolourable are the incidence graphs of complementary Hadamard designs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2016
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548316000390